Odd Minimum Cut Sets and b-Matchings Revisited
نویسندگان
چکیده
منابع مشابه
Odd minimum cut sets and b-matchings revisited
The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.
متن کاملOdd subgraphs and matchings
Let G be a graph and f : V (G) → {1, 3, 5, . . .}. Then a subgraph H of G is called a (1, f)-odd subgraph if degH(x) ∈ {1, 3, . . . , f(x)} for all x ∈ V (H). If f(x) = 1 for all x ∈ V (G), then a (1, f)-odd subgraph is nothing but a matching. A (1, f)-odd subgraph H of G is said to be maximum if G has no (1, f)-odd subgraph K such that |K| > |H|. We show that (1, f)-odd subgraphs have some pro...
متن کاملOn the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets
Let P and Q be disjoint point sets with 2k and 2l elements respectively, and M1 and M2 be their minimum weight perfect matchings (with respect to edge lengths). We prove that the edges of M1 and M2 intersect at most |M1| + |M2| − 1 times. This bound is tight. We also prove that P and Q have perfect matchings (not necessarily of minimum weight) such that their edges intersect at most min{r, s} t...
متن کاملBalloons, cut-edges, matchings, and total domination in regular graphs of odd degree
A balloon in a graph G is a maximal 2-edge-connected subgraph incident to exactly one cut-edge of G. Let b(G) be the number of balloons, let c(G) be the number of cut-edges, and let ′(G) be the maximum size of a matching. Let Fn,r be the family of connected (2r+1)regular graphs with n vertices, and let b=max{b(G) :G∈Fn,r}. For G∈Fn,r, we prove the sharp inequalities c(G)≤ [r(n−2)−2] / (2r2+2r−1...
متن کاملAlternating paths revisited II: restricted b-matchings in bipartite graphs
We give a constructive proof for a min-max relation on restricted b-matchings in bipartite graphs, extending results of Hartvigsen [5, 6], Király [7], and Frank [3]. Restricted b-matching is a special case of covering pairs of sets, for which Benczúr and Végh [1, 2] constructed a polynomial time algorithm – this implies a polynomial time algorithm for restricted b-matchings, as well. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2008
ISSN: 0895-4801,1095-7146
DOI: 10.1137/060664793